搜索资源列表
LCKNAP
- 背包问题的LC分支-限界算法 计算机算法设计背包问题求解-LC branch knapsack problem- a computer algorithm and bound algorithm for solving knapsack problem
global optimization
- Global optimization is a branch of applied mathematics and numerical analysis that deals with the optimization of a function or a set of functions according to some criteria. Typically, a set of bound and more general constraints is also present, and
Bound-constraint
- 界约束优化问题是最优化的主要类型，是最优化方向的主要分支-Bounded constrained optimization problem is the main type of optimization, and it is the main branch of the optimization direction.
branch-bound.ppt
- Design and Analysis Algorithm Branch Bound
Chapter9
- 用分支界限法来解决0-1背包问题，包含算法分析(Branch and bound method for solving 0-1 knapsack problem)
分枝限界算法
- 分支定界算法， 分支定界算法 分支定界算法 branch and bound(this is a branch and bound)